Search results for "Post canonical system"

showing 1 items of 1 documents

A decidable word problem without equivalent canonical term rewriting system

1989

We present a weak associative single-axiom system having the following property: the word problem is decidable with an efficient algorithm even though there does not exist any finite equivalent canonical term rewriting system.

Discrete mathematicsApplied MathematicsPost canonical systemComputer Science ApplicationsDecidabilityPhilosophy of languageComputational Theory and MathematicsConfluenceComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONWord problem (mathematics)RewritingEquivalence (formal languages)Computer Science::Formal Languages and Automata TheoryAssociative propertyMathematicsInternational Journal of Computer Mathematics
researchProduct